Programming Language Features for Refinement

Programming Language Features for Refinement

module A { type T function F(x: T): T function Twice(x: T): T { F(F(x)) } } module B refines A { type T = T’ datatype T’ = Leaf(int) | Node(T, T) function F... { match x case Leaf(w) => Leaf(w+1) case Node(left, right) => Node(F(left), F(right)) } } Figure 0. Two example modules, one (B) declared as a refinement of the other (A). • Refine previously given specifications (for example, strengthen...

A Plea for Pluggable Programming Language Features

Heuristic Evaluation of Programming Language Features

Usability is an important feature for programming languages. However, user studies which compare programming languages or systems are both very expensive and typically inconclusive. In this paper, we posit that discount usability methods can be successfully applied to programming languages concepts such as language features. We give examples of useful feedback received from applying heuristic e...

Language and Operating System Features for Real-time Programming

The adjective reql-tíme when applied to a computer system means that the system in question was designed to perform a task that, by its very nature, has firm deadlines that must be met for the system to be considered to be performing the task. Real-time does not mean simply fast oi .urn very fast. The design features that make a programming language or operating system efficienl and efféctive f...

Iterative Refinement for Linear Programming

We describe an iterative refinement procedure for computing extended precision or exact solutions to linear programming problems (LPs). Arbitrarily precise solutions can be computed by solving a sequence of closely related LPs with limited precision arithmetic. The LPs solved share the same constraint matrix as the original problem instance and are transformed only by modification of the object...